Monte Carlo Algorithm for Least Dependent Non-Negative Mixture Decomposition
نویسندگان
چکیده
We propose a simulated annealing algorithm (stochastic non-negative independent component analysis, SNICA) for blind decomposition of linear mixtures of non-negative sources with non-negative coefficients. The demixing is based on a Metropolis-type Monte Carlo search for least dependent components, with the mutual information between recovered components as a cost function and their non-negativity as a hard constraint. Elementary moves are shears in two-dimensional subspaces and rotations in three-dimensional subspaces. The algorithm is geared at decomposing signals whose probability densities peak at zero, the case typical in analytical spectroscopy and multivariate curve resolution. The decomposition performance on large samples of synthetic mixtures and experimental data is much better than that of traditional blind source separation methods based on principal component analysis (MILCA, FastICA, RADICAL) and chemometrics techniques (SIMPLISMA, ALS, BTEM).
منابع مشابه
Pricing and Hedging Asian Basket Options with Quasi-Monte Carlo Simulations
In this article we consider the problem of pricing and hedging high-dimensional Asian basket options by Quasi-Monte Carlo simulation. We assume a Black-Scholes market with time-dependent volatilities and show how to compute the deltas by the aid of the Malliavin Calculus, extending the procedure employed by Montero and Kohatsu-Higa [1]. Efficient path-generation algorithms, such as Linear Trans...
متن کاملRectified Gaussian Scale Mixtures and the Sparse Non-Negative Least Squares Problem
In this paper, we develop a Bayesian evidence maximization framework to solve the sparse non-negative least squares problem (S-NNLS). We introduce a family of scale mixtures referred as to Rectified Gaussian Scale Mixture (RGSM) to model the sparsity enforcing prior distribution for the signal of interest. Through proper choice of the mixing density, the R-GSM prior encompasses a wide variety o...
متن کاملBayesian Forecasting of Prepayment Rates for Individual Pools of Mortgages
This paper proposes a novel approach for modeling prepayment rates of individual pools of mortgages. The model incorporates the empirical evidence that prepayment is past dependent via Bayesian methodology. There are many factors that influence the prepayment behavior and for many of them there is no available (or impossible to gather) information. We implement this issue by creating a Bayesian...
متن کاملEvaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملDynamic Monte Carlo self-modeling curve resolution method for multicomponent mixtures
A new algorithm for performing self-modeling curve resolution (SMCR) on second-order bilinear data sets is described. The new method, called Dynamic Monte Carlo SMCR (DMC-SMCR), seeks to define boundaries of allowable pure component profiles (spectra, concentrations, etc.) in mixture analysis. The algorithm employs a directed Monte Carlo approach to search for valid solutions with high efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Analytical chemistry
دوره 78 5 شماره
صفحات -
تاریخ انتشار 2006